Structural invariants of antigen binding: comparison of immunoglobulin VL-VH and VL-VL domain dimers.
نویسندگان
چکیده
منابع مشابه
Structural invariants of antigen binding: comparison of immunoglobulin VL-VH and VL-VL domain dimers.
Antigen-combining site arises by noncovalent association of the variable domain of the immunoglobulin heavy chain (VH) with that of the light chain (VL). To analyze the invariant features of the binding region (VL-VH domain interface), we compared the known immunoglobulin three-dimensional structures by a variety of methods. The interface forms a close-packed, twisted, prism-shaped "beta-barrel...
متن کاملGermline VH/VL pairing in antibodies.
Antibodies are key molecules of the adaptive immune response and are now a major class of biopharmaceuticals. Pairing of heavy and light chains is one of the ways of generating antibody diversity and, while little is known about mechanisms governing V(H)/V(L) pairing, previous studies have suggested that the germline source from which chains are paired is random. By selecting paired antibody pr...
متن کاملAnalysis and prediction of VH/VL packing in antibodies.
The packing of V(H) and V(L) domains in antibodies can vary, influencing the topography of the antigen-combining site. However, until recently, this has largely been ignored in modelling antibody structure. We present an analysis of the degree of variability observed in known structures together with a machine-learning approach to predict the packing angle. A neural network was trained on sets ...
متن کاملDNA binding by the VH domain of anti-Z-DNA antibody and its modulation by association of the VL domain.
mAb Z22 is a highly selective IgG anti-Z-DNA Ab from an immunized C57BL/6 mouse. Previous studies showed that heavy chain CDR3 amino acids are critical for Z-DNA binding by the single chain variable fragment (scFv) comprising both V region heavy chain (VH) and V region light chain (VL) of mAb Z22 and that the VH domain alone binds Z-DNA with an affinity similar to that of whole variable fragmen...
متن کاملSkriptum VL Text Indexing
In this section we will introduce suffix trees, which, among many other things, can be used to solve the string matching task (find pattern P of length m in a text T of length n in O(n + m) time). We already know that other methods (Boyer-Moore, e.g.) solve this task in the same time. So why do we need suffix trees? The advantage of suffix trees over the other string-matching algorithms (Boyer-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1985
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.82.14.4592